BULK UPDATES AND CACHE SENSITIVITY IN SEARCH TREES Doctoral Dissertation
نویسندگان
چکیده
OF DOCTORAL DISSERTATION HELSINKI UNIVERSITY OF TECHNOLOGY P.O. Box 1000, FI-02015 TKK http://www.tkk.fi/ Author Riku Saikkonen Name of the dissertation Bulk Updates and Cache Sensitivity in Search Trees Manuscript submitted 09.04.2009 Manuscript revised 15.08.2009 Date of the defence 04.09.2009 £ Monograph ¤ Article dissertation (summary + original articles) Faculty Faculty of Information and Natural Sciences Department Department of Computer Science and Engineering Field of research Software Systems Opponent(s) Prof. Peter Widmayer Supervisor Prof. Eljas Soisalon-Soininen Instructor Prof. Eljas Soisalon-Soininen
منابع مشابه
External-Memory Search Trees with Fast Insertions
This thesis provides both experimental and theoretical contributions regarding externalmemory dynamic search trees with fast insertions. The first contribution is the implementation of the buffered repository B-tree, a data structure that provably outperforms B-trees for updates at the cost of a constant factor decrease in query performance. This thesis also describes the cache-oblivious lookah...
متن کاملOn Updating and Balancing Relaxed Balanced Search Trees in Main Memory
In this thesis, various methods for maintaining balanced search trees in main memory are considered. The work concentrates on algorithms applying relaxed balancing in which updates and rebalancing are uncoupled from each other. A new relaxed balanced tree, the rank-valued tree, which is a relaxed version of symmetric binary B-trees, also known as red-black trees, is introduced and analyzed. Ran...
متن کاملFractal Prefetching B+trees: Optimizing Both Cache and Disk Performance (CMU-CS-02-115)
B-Trees have been traditionally optimized for I/O performance with disk pages as tree nodes. Recently, researchers have proposed new types of B-Trees optimized for CPU cache performance in main memory environments, where the tree node sizes are one or a few cache lines. Unfortunately, due primarily to this large discrepancy in optimal node sizes, existing disk-optimized B-Trees su er from poor ...
متن کاملPALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors
Concurrency control on B trees is primarily achieved with latches, but serialization and contention can hinder scalability. As core counts on current processors increase, it is imperative to develop scalable latch-free techniques for concurrency control. We present PALM, a novel technique for performing multiple concurrent queries on in-memory B trees. PALM is based on the Bulk Synchronous Para...
متن کاملOblivious Substring Search with Updates
We are the first to address the problem of efficient oblivious substring search over encrypted data supporting updates. Our two new protocols SA-ORAM and ST-ORAM obliviously search for substrings in an outsourced set of n encrypted strings. Both protocols are efficient, requiring communication complexity that is only poly-logarithmic in n. Compared to a straightforward solution for substring se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009